Best approximation of a normal operator in the Schatten $p$-norm
نویسندگان
چکیده
منابع مشابه
The Best Constants for Operator Lipschitz Functions on Schatten Classes
Suppose that f is a Lipschitz function on R with ‖f‖Lip ≤ 1. Let A be a bounded self-adjoint operator on a Hilbert space H. Let p ∈ (1,∞) and suppose that x ∈ B(H) is an operator such that the commutator [A, x] is contained in the Schatten class Sp. It is proved by the last two authors, that then also [f(A), x] ∈ Sp and there exists a constant Cp independent of x and f such that ‖[f(A), x]‖p ≤ ...
متن کاملA Unified Convex Surrogate for the Schatten-p Norm
The Schatten-p norm (0 < p < 1) has been widely used to replace the nuclear norm for better approximating the rank function. However, existing methods are either 1) not scalable for large scale problems due to relying on singular value decomposition (SVD) in every iteration, or 2) specific to some p values, e.g., 1/2, and 2/3. In this paper, we show that for any p, p1, and p2 > 0 satisfying 1/p...
متن کاملJoint Schatten p - norm and p - norm robust matrix completion for missing value recovery
The low-rank matrix completion problem is a fundamental machine learning and data mining problem with many important applications. The standard low-rank matrix completion methods relax the rank minimization problem by the trace norm minimization. However, this relaxation may make the solution seriously deviate from the original solution. Meanwhile, most completion methods minimize the squared p...
متن کاملLow-Rank Matrix Recovery via Efficient Schatten p-Norm Minimization
As an emerging machine learning and information retrieval technique, the matrix completion has been successfully applied to solve many scientific applications, such as collaborative prediction in information retrieval, video completion in computer vision, etc. The matrix completion is to recover a low-rank matrix with a fraction of its entries arbitrarily corrupted. Instead of solving the popul...
متن کاملVisual Processing by a Unified Schatten-p Norm and ℓq Norm Regularized Principal Component Pursuit
In this paper, we propose a non-convex formulation to recover the authentic structure from the corrupted real data. Typically, the specific structure is assumed to be low rank, which holds for a wide range of data, such as images and videos. Meanwhile, the corruption is assumed to be sparse. In the literature, such a problem is known as Robust Principal Component Analysis (RPCA), which usually ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1980
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1980-0577759-3